Minimality Results for the Spatial Logics

نویسندگان

  • Daniel Hirschkoff
  • Étienne Lozes
  • Davide Sangiorgi
چکیده

A spatial logic consists of four groups of operators: standard propositional connectives; spatial operators; a temporal modality; calculus-specific operators. The calculus-specific operators talk about the capabilities of the processes of the calculus, that is, the process constructors through which a process can interact with its environment. We prove some minimality results for spatial logics. The main results show that in the logics for π-calculus and asynchronous π-calculus the calculus-specific operators can be eliminated. The results are presented under both the strong and the weak interpretations of the temportal modality. Our proof techniques are applicable to other spatial logics, so to eliminate some of – if not all – the calculus-specific operators. As an example of this, we consider the logic for the Ambient calculus, with the strong semantics.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Elimination of spatial connectives in static spatial logics

The recent interest for specification on resources yields so-called spatial logics, that is specification languages offering new forms of reasoning: the local reasoning through the separation of the resource space into two disjoint subspaces, and the contextual reasoning through hypothetical extension of the resource space. We consider two resource models and their related logics: • The static ...

متن کامل

Abductive reasoning for image interpretation based on spatial concrete domains and description logics

Image interpretation aims not only at detecting and recognizing objects in a scene but also at deriving a semantic description considering contextual information in the whole scene. Image interpretation can be formalized as an abductive reasoning problem, i.e. an inference to the best explanation using a background knowledge. In this work, we present a framework using a tableau method for gener...

متن کامل

Minimal Models Modulo Subset-Simulation for Modal Logics

In this abstract we present a novel minimality criterion for models of propositional modal logics, and we sketch a tableau calculus for the generation of minimal models based on this new minimality criterion.

متن کامل

Minimal Change in AGM Revision for Non-Classical Logics

In this paper, we address the problem of applying AGMstyle belief revision to non-classical logics. We discuss the idea of minimal change in revision and show that for non-classical logics, some sort of minimality postulate has to be explicitly introduced. We also present two constructions for revision which satisfy the AGM postulates and prove the representation theorems including minimality p...

متن کامل

Computing Minimal Models Modulo Subset-Simulation for Modal Logics

In this paper we propose a novel minimality criterion for models of modal logics based on a variation of the notion of simulation, called subset-simulation. We present a minimal model sound and complete tableau calculus for the generation of this new kind of minimal models for the multi-modal logic K(m), and we discuss extensions to cover more expressive logics. The generation of minimal models...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003